Structural Decomposition and Serial Solution of SPN Models of the ATM GAUSS Switch

نویسندگان

  • Boudewijn R. Haverkort
  • Hessel P. Idzenga
چکیده

We address the performance, in particular, the cell loss ratio, of the ATM GAUSS switch under a variety of realistic video and constant bit rate traac patterns. We describe the operation of the GAUSS switch and derive a stochastic Petri net model for it. One problem with this model, when subjected to realistic traac, is that it is too large (in terms of states of the underlying Markov chain) to be analysed. We circumvent this largeness problem by structurally decomposing this model in a number of smaller models that can be solved in a serial fashion, thereby using analysis results of one another. This approach not only speeds up the solution process by several orders of magnitude, it also still yields accurate results. With respect to the GAUSS switch we show that under realistic traac, the internal buuers need to be doubled in size, as opposed to analysis results under Poisson traac, to yield acceptable cell-loss performance. Concluding, this paper serves three aims: (i) it shows the suitability of stochastic Petri nets in the context of ATM system analysis; (ii) it illustrates a structural decomposition method circumventing the state space explosion problem; and (iii) it derives more detailed performance results for the GAUSS switch than has been possible previously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The method of radial basis functions for the solution of nonlinear Fredholm integral equations system.

In this paper, An effective and simple numerical method is proposed for solving systems of integral equations using radial basis functions (RBFs). We present an algorithm based on interpolation by radial basis functions including multiquadratics (MQs), using Legendre-Gauss-Lobatto nodes and weights. Also a theorem is proved for convergence of the algorithm. Some numerical examples are presented...

متن کامل

A new method for 3-D magnetic data inversion with physical bound

Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...

متن کامل

Application of semi-analytic method to compute the moments for solution of logistic model

The population growth, is increase in the number of individuals in population and it depends on some random environment effects. There are several different mathematical models for population growth. These models are suitable tool to predict future population growth. One of these models is logistic model. In this paper, by using Feynman-Kac formula, the Adomian decomposition method is applied to ...

متن کامل

Near-Minimum-Time Motion Planning of Manipulators along Specified Path

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999